package jianzhi;

import niuke.ListNode;

/**
 * description:
 * author:zt
 * date:2021-10-27
 */
//输入两个递增排序的链表，合并这两个链表并使新链表中的节点仍然是递增排序的。
public class jianzhi25 {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        ListNode head = new ListNode();
        ListNode res = head;
        while (l1!=null && l2!=null){
            if (l1.val <= l2.val) {
                head.next = l1;
                l1 = l1.next;
            }else {
                head.next = l2;
                l2 = l2.next;
            }
            head = head.next;
        }
        head.next = l1==null? l2:l1;
        return res.next;
    }
}
